1191D - Tokitsukaze CSL and Stone Game - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int modd = 114514;
const int N = 1919810;
int n,t,m;

void solve(){
	cin >> n;
	map<int,int> mp;
	for(int i = 0; i < n; i ++){
		cin >> m;
		mp[m] ++;
	}
	int num,cnt = 0;
	bool winn = 0;
	for(auto i : mp){
		if(i.second == 2){
			cnt ++;
			num = i.first;
		}
		if(i.second >= 3){
			cout << "cslnb\n";
			return;
		}
	}
	if(cnt >= 2){
		cout << "cslnb\n";
		return;
	}
	if(cnt == 1){
		if(num == 0){
			cout << "cslnb\n";
			return;
		}
		for(auto i : mp){
			if(i.first == num-1){
				cout << "cslnb\n";
				return;
			}
		}
		mp[num] --;
		mp[num-1]++;
		winn = 1;
	}
	int prenum = -1; cnt = 0;
	for(auto i : mp){
		int pp = i.first - cnt;
		if(pp & 1) winn = 1 - winn;
		cnt ++;
	}
	if(winn) cout <<  "sjfnb\n";
	else cout << "cslnb\n";
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	solve();
	return 0;
}